Asymptotic Analysis of Sample Average Approximation for Stochastic Optimization Problems with Joint Chance Constraints via CVaR/DC Approximations
نویسندگان
چکیده
Conditional Value at Risk (CVaR) has been recently used to approximate a chance constraint. In this paper, we study the convergence of stationary points when sample average approximation (SAA) method is applied to a CVaR approximated joint chance constrained stochastic minimization problem. Specifically, we prove, under some moderate conditions, that optimal solutions and stationary points obtained from solving sample average approximated problems converge with probability one (w.p.1) to their true counterparts. Moreover, by exploiting the recent results on large deviation of random functions [28] and sensitivity results for generalized equations [31], we derive exponential rate of convergence of stationary points and give an estimate of sample size. The discussion is extended to the case when CVaR approximation is replaced by a DC-approximation [14]. Some preliminary numerical test results are reported.
منابع مشابه
From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
We review and develop different tractable approximations to individual chance constrained problems in robust optimization on a varieties of uncertainty sets and show their interesting connections with bounds on the conditional-value-at-risk (CVaR) measure. We extend the idea to joint chance constrained problems and provide a new formulation that improves upon the standard approach. Our approach...
متن کاملChance constrained problems: penalty reformulation and performance of sample approximation technique
We explore reformulation of nonlinear stochastic programs with several joint chance constraints by stochastic programs with suitably chosen penalty-type objectives. We show that the two problems are asymptotically equivalent. Simpler cases with one chance constraint and particular penalty functions were studied in [6, 11]. The obtained problems with penalties and with a fixed set of feasible so...
متن کاملA smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure
This paper is concerned with solving single CVaR and mixed CVaR minimization problems. A CHKS-type smoothing sample average approximation (SAA) method is proposed for solving these two problems, which retains the convexity and smoothness of the original problem and is easy to implement. For any fixed smoothing constant 2, this method produces a sequence whose cluster points are weak stationary ...
متن کاملSample average approximation of expected value constrained stochastic programs
We propose a sample average approximation (SAA) method for stochastic programming problems involving an expected value constraint. Such problems arise, for example, in portfolio selection with constraints on conditional value-at-risk (CVaR). Our contributions include an analysis of the convergence rate and a statistical validation scheme for the proposed SAA method. Computational results using ...
متن کاملConvergence of stochastic average approximation for stochastic optimization problems with mixed expectation and per-scenario constraints
We present a framework for ensuring convergence of sample average approximations to stochastic optimization problems that include expectation constraints in addition to per-scenario constraints.
متن کامل